Universal Structures

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Universal knowledge-belief structures

In this paper, we provide a notion of structure preserving maps (i.e. knowledge-belief morphisms) between knowledge-belief spaces. Then we show that under the condition that the knowledge operators of the players in a knowledge-belief space operate just on measurable subsets of the space there is a unique (up to isomorphism) universal knowledge-belief space to which every knowledge-belief space...

متن کامل

Complexity of universal access structures

An important parameter in a secret sharing scheme is the number of minimal qualified sets. Given this number, the universal access structure is the richest possible structure, namely the one in which there are one or more participants in every possible Boolean combination of the minimal qualified sets. Every access structure is a substructure of the universal structure for the same number of mi...

متن کامل

Canonical Partitions Of Universal Structures

Let U = (U,L) be a universal binary countable homogeneous structure and n ∈ ω. We determine the equivalence relation C(n)(U) on [U ] with the smallest number of equivalence classes r so that each one of the classes is indivisible. As a consequence we obtain

متن کامل

Universal Structures with Forbidden Homomorphisms

We relate the existence problem of universal objects to the properties of corresponding enriched categories (lifts or expansions). In particular, extending earlier results, we prove that for every regular set F of finite connected structures there exists a (countable) ω-categorical universal structure U for the class Forbh(F) (of all countable structures not containing any homomorphic image of ...

متن کامل

Universal cycles for combinatorial structures

Chung, F., P. Diaconis and R. Graham, Universal cycles for combinatorial structures, Discrete Mathematics 110 (1992) 43-59 In this paper, we explore generalizations of de Bruijn cycles for a variety of families of combinatorial structures, including permutations, partitions and subsets of a finite set.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Notre Dame Journal of Formal Logic

سال: 2017

ISSN: 0029-4527

DOI: 10.1215/00294527-3800985